Computing isomorphisms between lattices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

متن کامل

Computing isomorphisms and embeddings of finite fields

Let Fq be a finite field. Given two irreducible polynomials f, g over Fq, with deg f dividing deg g, the finite field embedding problem asks to compute an explicit description of a field embedding of Fq[X]/f(X) into Fq[Y ]/g(Y ). When deg f = deg g, this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in computer algeb...

متن کامل

A Banach-stone Theorem for Riesz Isomorphisms of Banach Lattices

Let X and Y be compact Hausdorff spaces, and E, F be Banach lattices. Let C(X,E) denote the Banach lattice of all continuous E-valued functions on X equipped with the pointwise ordering and the sup norm. We prove that if there exists a Riesz isomorphism Φ : C(X,E) → C(Y, F ) such that Φf is non-vanishing on Y if and only if f is non-vanishing on X, then X is homeomorphic to Y , and E is Riesz i...

متن کامل

Some Isomorphisms Between Functor Categories

The scheme ChoiceD concerns a non-empty set A, a non-empty set B, and a binary predicate P, and states that: there exists a function h from A into B such that for every element a of A holds P[a, h(a)] provided the parameters meet the following requirement: • for every element a of A there exists an element b of B such that P[a, b]. Let A, B, C be non-empty sets, and let f be a function from A i...

متن کامل

Weak isomorphisms between Bernoulli shifts

In this note, we prove that if G is a countable group that contains a nonabelian free subgroup then every pair of nontrivial Bernoulli shifts over G are weakly isomorphic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2020

ISSN: 0025-5718,1088-6842

DOI: 10.1090/mcom/3543